Gabor feature constrained statistical model for efficient landmark localization and face recognition
نویسندگان
چکیده
Feature extraction and classification using Gabor wavelets have proven to be successful in computer vision and pattern recognition. Gabor feature based Elastic Bunch Graph Matching (EBGM), which demonstrated excellent performance in the FERET evaluation test, has been considered as one of the best algorithms for face recognition due to its robustness against expression, illumination and pose variations. However, EBGM involves considerable computational complexity in its rigid and deformable matching process, preventing its use in many real-time applications. This paper presents a new Constrained Profile Model (CPM), in cooperation with Flexible Shape Model (FSM) to form an efficient localization framework. Through Gabor feature constrained local alignment, the proposed method not only avoids local minima in landmark localization, but also circumvents the exhaustive global optimization. Experiments on CAS-PEAL and FERET databases demonstrated the effectiveness and efficiency of the proposed method.
منابع مشابه
Robust Face Recognition using AAM and Gabor Features
In this paper, we propose a face recognition algorithm using AAM and Gabor features. Gabor feature vectors which are well known to be robust with respect to small variations of shape, scaling, rotation, distortion, illumination and poses in images are popularly employed for feature vectors for many object detection and recognition algorithms. EBGM, which is prominent among face recognition algo...
متن کاملتشخیص چهره با استفاده از PCA و فیلتر گابور
Methods for face recognition which are based on face structure are among techniques without supervision and produce unfavorable results in the presence of linear changes in images. PCA is a linear transform and a powerful tool for data analysis but does not produce good results for face recognition when there are non-linear changes resulting from changes in position, intensity and gesture in th...
متن کاملWe Hereby Recommend That the Thesis Prepared under Our Supervision by David S. Bolme Entitled Elastic Bunch Graph Matching Be Accepted as Fulfill- Ing in Part Requirements for the Degree of Master of Science
OF THESIS ELASTIC BUNCH GRAPH MATCHING Elastic Bunch Graph Matching is a face recognition algorithm that is distributed with CSU’s Evaluation of Face Recognition Algorithms System. The algorithm is modeled after the Bochum/USC face recognition algorithm used in the FERET evaluation. The algorithm recognizes novel faces by first localizing a set of landmark features and then measuring similarity...
متن کاملRobust facial feature tracking under varying face pose and facial expression
This paper presents a hierarchical multi-state pose-dependent approach for facial feature detection and tracking under varying facial expression and face pose. For effective and efficient representation of feature points, a hybrid representation that integrates Gabor wavelets and gray-level profiles is proposed. To model the spatial relations among feature points, a hierarchical statistical fac...
متن کاملFace Recognition by Extending Elastic Bunch Graph Matching with Particle Swarm Optimization
Elastic Bunch Graph Matching is one of the well known methods proposed for face recognition. In this work, we propose several extensions to Elastic Bunch Graph Matching and its recent variant Landmark Model Matching. We used data from the FERET database for experimentations and to compare the proposed methods. We apply Particle Swarm Optimization to improve the face graph matching procedure in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition Letters
دوره 30 شماره
صفحات -
تاریخ انتشار 2009